A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales

نویسندگان

  • Retsef Levi
  • Ganesh Janakiraman
  • Mahesh Nagarajan
چکیده

In this paper, we describe the first computationally efficient policies for stochastic inventory models with lost sales and replenishment lead times that admit worst-case performance guarantees. In particular, we introduce dual-balancing policies for lost-sales models that are conceptually similar to dual-balancing policies recently introduced for a broad class of inventory models in which demand is backlogged rather than lost. That is, in each period, we balance two opposing costs: the expected marginal holding costs against the expected marginal lost-sales cost. Specifically, we show that the dual-balancing policies for the lost-sales models provide a worst-case performance guarantee of two under relatively general demand structures. In particular, the guarantee holds for independent (not necessarily identically distributed) demands and for models with correlated demands such as the AR 1 model and the multiplicative autoregressive demand model. The policies and the worst-case guarantee extend to models with capacity constraints on the size of the order and stochastic lead times. Our analysis has several novel elements beyond the balancing ideas for backorder models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(Q,r) Stochastic Demand Inventory Model With Exact Number of Cycles

In most stochastic inventory models, such as continuous review models and periodic review models, it has been assumed that the stockout period during a cycle is small enough to be neglected so that the average number of cycles per year can be approximated as D/Q, where D is the average annual demand and Q is the order quantity. This assumption makes the problem more tactable, but it should not ...

متن کامل

(Q,r) Stochastic Demand Inventory Model With Exact Number of Cycles

In most stochastic inventory models, such as continuous review models and periodic review models, it has been assumed that the stockout period during a cycle is small enough to be neglected so that the average number of cycles per year can be approximated as D/Q, where D is the average annual demand and Q is the order quantity. This assumption makes the problem more tactable, but it should not ...

متن کامل

Nonparametric Algorithms for Joint Pricing and Inventory Control with Lost-Sales and Censored Demand

We consider the classical joint pricing and inventory control problem with lost-sales and censored demand in which the customer’s response to selling price and the demand distribution are not known a priori, and the only available information for decision-making is the past sales data. Conventional approaches, such as stochastic approximation, online convex optimization, and continuum-armed ban...

متن کامل

A Mathematical Method for Managing Inventories in a Dual Channel Supply Chain

  The advent of e-commerce has prompted many manufacturers to redesign their traditional channel structure by engaging in direct sales. In this paper, we present a dual channel inventory model based on queuing theory in a manufacturer-retailer supply chain, consisting of a traditional retail channel and a direct channel which stocks are kept in both upper and lower echelon. The system receives ...

متن کامل

Multidimensional Approximation Algorithms for Capacity-Expansion Problems

We develop multi-dimensional balancing algorithms to compute provably near-optimal capacity-expansion policies. These are the first approximation algorithms for multi-machine, multi-product systems facing stochastic, non-stationary and correlated demands. Our approach is computationally efficient and guaranteed to produce a policy with total expected cost no more than twice that of an optimal p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2008